|
|
|
 |
|
|
|
|
|
|
|
|
|
|
Aggregation approximations for sensitivity analysis of multi-class
queueing networks
Show Abstract
|
Glasserman, P., Ho, Y.-C.
|
1989 |
Performance
Evaluation
10 (4), pp. 295-308
|
0
|
| | | | |
|
|
On the value of predictive information in a scheduling problem
Show Abstract
|
Matloff, N.S.
|
1989 |
Performance
Evaluation
10 (4), pp. 309-315
|
0
|
| | | | |
|
|
A conservation law based approximate analysis for a class of
simultaneous resource possession problems
Show Abstract
|
Kaufman, J.S., Wang, Y.T.
|
1989 |
Performance
Evaluation
10 (4), pp. 263-280
|
1
|
| | | | |
|
|
Efficient calculation of the space-time performance of the working
set
Show Abstract
|
Chastek, G., Kearns, J.P.
|
1989 |
Performance
Evaluation
10 (4), pp. 281-294
|
0
|
| | | | |
|
|
An explicit separation of relativised random polynomial time and
relativised deterministic polynomial time
Show Abstract
|
Zippel, R.
|
1989 |
Information
Processing Letters
33 (4), pp. 207-212
|
0
|
| | | | |
|
|
Parallel batched planar point location on the CCC
|
Lee, D.T., Preparata, F.P.
|
1989 |
Information
Processing Letters
33 (4), pp. 175-179
|
2
|
| | | | |
|
|
A randomised heuristical algorithm for estimating the chromatic number
of a graph
|
Žerovnik, J.
|
1989 |
Information
Processing Letters
33 (4), pp. 213-219
|
1
|
| | | | |
|
|
Finding the upper envelope of n line segments in O(n log n) time
Show Abstract
|
Hershberger, J.
|
1989 |
Information
Processing Letters
33 (4), pp. 169-174
|
66
|
| | | | |
|
|
A note on adaptive parallel sorting
Show Abstract
|
Levcopoulos, C., Petersson, O.
|
1989 |
Information
Processing Letters
33 (4), pp. 187-191
|
1
|
| | | | |
|
|
An algorithm to find polygon similarity
Show Abstract
|
Boreddy, J., Mukherjee, R.N.
|
1989 |
Information
Processing Letters
33 (4), pp. 205-206
|
0
|
| | | | |
|
|
Undecidability of the bandwidth problem on linear graph languages
Show Abstract
|
Wanke, E., Wiegers, M.
|
1989 |
Information
Processing Letters
33 (4), pp. 193-197
|
0
|
| | | | |
|
|
On the polynomial IO-complexity
|
Rolim, JosD.P.
|
1989 |
Information
Processing Letters
33 (4), pp. 199-204
|
0
|
| | | | |
|
|
Optimal merging and sorting on the EREW PRAM
Show Abstract
|
Hagerup, T., Rüb, C.
|
1989 |
Information
Processing Letters
33 (4), pp. 181-185
|
21
|
| | | | |
|
|
Declarative modeling of the operational behavior of logic
languages
Show Abstract
|
Falaschi, M., Levi, G., Palamidessi, C., Martelli, M.
|
1989 |
Theoretical
Computer Science
69 (3), pp. 289-318
|
62
|
| | | | |
|
|
Growth problems for avoidable words
Show Abstract
|
Baker, K.A., McNulty, G.F., Taylor, W.
|
1989 |
Theoretical
Computer Science
69 (3), pp. 319-345
|
22
|
| | | | |
|
|
A syntactic theory of sequential state
Show Abstract
|
Felleisen, M., Friedman, D.P.
|
1989 |
Theoretical
Computer Science
69 (3), pp. 243-287
|
16
|
| | | | |
|
|
Fuzzy kriging
Show Abstract
|
Diamond, P.
|
1989 |
Fuzzy
Sets and Systems
33 (3), pp. 315-332
|
17
|
| | | | |
|
|
Fuzzy clustering methods based on perturbation
Show Abstract
|
Hongxing, L.
|
1989 |
Fuzzy
Sets and Systems
33 (3), pp. 291-302
|
5
|
| | | | |
|
|
Fuzzy control theory: The linear case
Show Abstract
|
Siler, W., Ying, H.
|
1989 |
Fuzzy
Sets and Systems
33 (3), pp. 275-290
|
32
|
| | | | |
|
|
Quantum chemistryliterature data base supplement 8. Bibliography of ab
initio calculations for 1988
Show Abstract
|
Ohno, K., Moroküma, K., Hosoya, H., Hirota, F., Iwata, S., Osamura, Y., Kashiwagi, H., (...), Yamabe, S.
|
1989 |
Journal
of Molecular Structure: THEOCHEM
203 (C), pp. 1-4
|
0
|
| | | | |
